Minimizing Total Completion Time in Mixed-Blocking Permutation Flowshops
نویسندگان
چکیده
منابع مشابه
Minimizing Mean Completion Time in Flowshops with Random Processing Times
RACT : We consider the two-machine flowshop scheduling problem where jobs have random processing times are bounded within certain intervals. The objective is to minimize total completion time of all jobs. The decision of a solution for the problem has to be made based on the lower and upper bounds on job processing times since this only information available. The problem is NP-hard since the sp...
متن کاملIterated Local Search Heuristics for Minimizing Total Completion Time in Permutation and Non-permutation Flow Shops
We study the improvement of non-permutation over permutation schedules in flow shops when minimizing the total completion time. We solve both problems by a two-phase heuristic. The first phase uses an iterated local search to find a good permutation schedule. The second phase explores non-permutation schedules using an effective insertion neighborhood, that permits to anticipate or delay a job ...
متن کاملA Two-Phase Constructive Heuristic for Permutation Flow-Shop Scheduling Problem Minimizing Total Completion Time
This paper describes a polynomial-time heuristic for the permutation flow-shop scheduling problem with the criterion of minimizing total completion time. The proposed method consists of two phases: arranging the jobs in priority order and then constructing a sequence. A new ranking method is employed to prioritize the jobs for incorporating into the construction phase of the heuristic. Computat...
متن کاملMinimizing total weighted completion
We study the special case of the m machine ow shop problem in which the processing time of each operation of job j is equal to p j ; this variant of the ow shop problem is known as the proportionate ow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that...
متن کاملMinimizing Total Flow Time in Permutation Flowshop Environment
The permutation flowshop scheduling problem with the objective of minimizing total flow time is known as a NP-hard problem, even for the two-machine cases. Because of the computational complexity of this problem, a multi-start simulated annealing (MSA) heuristic, which adopts a multi-start hill climbing strategy in the simulated annealing (SA) heuristic, is proposed to obtain close-to-optimal s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3014106